Neuere Entwicklungen der deklarativen KI-Programmierung : proceedings

The field of declarative AI programming is briefly characterized. Its recent developments in Germany are reflected by a workshop as part of the scientific congress KI-93 at the Berlin Humboldt University. Three tutorials introduce to the state of the art in deductive databases, the programming language Gödel, and the evolution of knowledge bases. Eleven contributed papers treat knowledge revision/program transformation, types, constraints, and type-constraint combinations

Coordinating distributed CLP-solvers in medical appointment scheduling

Abstract. Research on monolithic logic-based systems has usually left out an important aspect of information technology systems supporting medical processes — distribution. Often social restrictions build up by questions of authority prohibit the implementation of global systems with omniscient view. Hence, IT in medical domains has to obey these restrictions by being distributed as well. The direct consequence is the need for communication and coordination. In this paper, we present an industrial-size case study in medical appointment scheduling that is envisaged to be solved by combining the strength of CLP for local (internal) problems with the strength of coordination for external problems. The essence of this approach is the realization of a multi agent system (MAS) consisting of CLP-based agents.

Using Logic Programming in Java Environment (Extended Abstract)

) Dmitri Boulanger Ulrich Geske GMD-FIRST, Rudower Chaussee 5, 12489 Berlin, Germany email: fdmitri,[email protected] Abstract Using the logic programming system Minerva, Java and DMBS Oracle for development of a GIS-oriented constraint database systems is discussed. The central topic is a possibility to develop systems, which are approaching industrial standards. Namely, a technology for building applications, which need high quality graphical interfaces, which use data stored in commercial SQL databases and which enjoy advantages of of logic programming and constraint solving is the main goal. A number of important basic elements of the corresponding toolkit, which is currently under development, are introduced. Key Words: logic programming, Java, object-oriented programming, declarative semantics, constraint database systems, persistence, GIS applications 1 Introduction For a large class of important applications a declarative logic-based knowledge representation is a crucial ..

Cardinality Constraints in Disjunctive Deductive Databases

We will consider cardinality constraints of the form M ,! K, 2 f=; ; g, stating that \(exactly, at most, at least) K elements out of a set M have to be chosen". We will show how a set C of constraints can be represented by means of a positive{disjunctive deductive database P C , such that the models of P C correspond to the solutions of C. This allows for embedding cardinality constraints into applications dealing with incomplete knowledge. We will also present a sound calculus represented by a denite logic program P cc= , which allows for directly reasoning with sets of exactly{cardinality constraints. Reasoning with P cc= is very ecient, and it can be used for performance reasons before P C is evaluated. For obtaining completeness , however, P C is necessary, since we show the theoretical result that a sound and complete calculus for exactly{ cardinality constraints does not exist. Keywords disjunctive logic programming, constraint logic programming, cardinality constraints,..